Decision Making Photonics: Solving Bandit Problems Using Photons

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Bayesian analysis of human decision-making on bandit problems

The bandit problem is a dynamic decision-making task that is simply described, well-suited to controlled laboratory study, and representative of a broad class of real-world problems. In bandit problems, people must choose between a set of alternatives, each with different unknown reward rates, to maximize the total reward they receive over a fixed number of trials. A key feature of the task is ...

متن کامل

A Practical Method for Solving Contextual Bandit Problems Using Decision Trees

Many efficient algorithms with strong theoretical guarantees have been proposed for the contextual multi-armed bandit problem. However, applying these algorithms in practice can be difficult because they require domain expertise to build appropriate features and to tune their parameters. We propose a new method for the contextual bandit problem that is simple, practical, and can be applied with...

متن کامل

Bayesian Nonparametric Modeling of Individual Differences: A Case Study Using Decision-Making on Bandit Problems

We develop and compare two non-parametric Bayesian approaches for modeling individual differences in cognitive processes. These approaches both allow major discrete differences between groups of people to be modeled, without making strong prior assumptions about how many groups are required. Instead, the number of groups can naturally grow as more information about the behavior of people become...

متن کامل

Anticipating Computational Demands when Solving Time-Critical Decision-Making Problems

An agent embedded in a dynamic environment may need to respond in a timely manner to sequences of events outside the agent's control. By anticipating computational demands and allocating processing time accordingly the agent can avoid costly delays often arising from trying to respond to a dynamic environment with high-complexity decision procedures. Deliberation scheduling, the process of allo...

متن کامل

Solving Sequential Decision-making Problems under Virtual Reality Simulation System

A large class of problems of sequential decision-making can be modeled as Markov or Semi-Markov Decision Problems, which can be solved by classical methods of dynamic programming. However, the computational complexity of the classical MDP algorithms, such as value iteration and policy iteration, is prohibitive and will grow intractably with the size of problems. Furthermore, they require for ea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Journal of Selected Topics in Quantum Electronics

سال: 2020

ISSN: 1077-260X,1558-4542

DOI: 10.1109/jstqe.2019.2929217